Sums of squares and negative correlation for spanning forests of series parallel graphs
نویسنده
چکیده
We provide new evidence that spanning forests of graphs satisfy the same negative correlation properties as spanning trees, derived from Lord Rayleigh’s monotonicity property for electrical networks. The main result of this paper is that the Rayleigh difference for the spanning forest generating polynomial of a series parallel graph can be expressed as a certain positive sum of monomials times squares of polynomials. We also show that every regular matroid is independent-set-Rayleigh if and only if every basis-Rayleigh binary matroid is also independent-set-Rayleigh.
منابع مشابه
NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملHow to determine the law of the noise driving a SPDE
where η is a space-time Lévy noise. A perturbative (in the sense of formal power series) strong solution is given by a tree expansion, whereas the correlation functions of the solution are given by a perturbative expansion with coefficients that are represented as sums over a certain class of graphs, called Parisi-Wu graphs. The perturbative expansion of the truncated (connected) correlation fu...
متن کاملSpanning forests and OSP (N |2M)-invariant σ-models
The present paper is part of our ongoing work on OSP (N |2M) supersymmetric σ-models, their relation with the Potts model at q = 0 and spanning forests, and the rigorous analytic continuation of the partition function as an entire function of N − 2M , a feature first predicted by Parisi and Sourlas in the 1970’s. Here we accomplish two main steps. First, we analyze in detail the role of the Isi...
متن کاملUltrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
We present a rst randomized O(log n) time and O(n+m) work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a randomized O(log log n) time and O(n log n) work CREW-PRAM algorithm for nding spanning trees in random graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 52 شماره
صفحات -
تاریخ انتشار 2012